Sensitivity analysis of discrete Markov chains via matrix calculus
نویسندگان
چکیده
منابع مشابه
Sensitivity analysis for finite Markov chains in discrete time
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering as basic uncertainty models the so-called credal sets that these probabilities are known or believed to belong to, and by allowing the probabilities to vary over such sets. This leads to the definition of an imprecise M...
متن کاملPointwise stabilization of discrete-time matrix-valued stationary Markov chains
Let (Ω,F ,P) be a probability space and S = {S1, . . . , SK} a discrete-topological space that consists of K real d-by-d matrices, where K and d both ≥ 2. In this paper, we study the pointwise stabilizability of a discrete-time, time-homogeneous, stationary (p, P)-Markovian jump linear system Ξ = (ξn) n=1 where ξn : Ω → S. Precisely, Ξ is called “pointwise convergent”, if to any initial state x...
متن کاملDiscrete Quantum Markov Chains
A framework for finite-dimensional quantum Markov chains on Hilbert spaces is introduced. Quantum Markov chains generalize both classical Markov chains with possibly hidden states and existing models of quantum walks on finite graphs. Quantum Markov chains are based on Markov operations that may be applied to quantum systems and include quantum measurements, for example. It is proved that quant...
متن کاملApproximation of discrete-time polling systems via structured Markov chains
We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic routing is a special case of Markovian routi...
متن کاملPerturbation Analysis in Verification of Discrete-Time Markov Chains
Perturbation analysis in probabilistic verification addresses the robustness and sensitivity problem for verification of stochastic models against qualitative and quantitative properties. We identify two types of perturbation bounds, namely non-asymptotic bounds and asymptotic bounds. Non-asymptotic bounds are exact, pointwise bounds that quantify the upper and lower bounds of the verification ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2013
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.07.046